Polarization and Polar Codes
نویسنده
چکیده
This tutorial treats the fundamentals of polarization theory and polar coding. Arıkan’s original results on binary source and channel polarization methods are studied. Error probability and complexity analyses are offered. The original results are generalized in several directions. Early developments in the field are discussed, pointers to some of the important work omitted from this tutorial are given.
منابع مشابه
Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملA New Construction of Nonbinary Polar Codes with Two-stage Polarization
In this paper, we propose a new class of nonbinary polar codes with two-stage polarization, where the outer polarization (symbol-level polarization) kernel is a nonbinary matrix resembling Arıkan’s kernel, and the inner polarization (bit-level polarization) kernel is a properly designed binary matrix. The encoder/decoder of the proposed nonbinary polar codes have the same structure as the origi...
متن کاملProperties and Construction of Polar Codes
Recently, Arıkan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm of polar codes, called successive cancellation decoding, can be regarded as belief propagation decoding, which has been used for decoding of low-density parity-...
متن کاملFast Polarization for Processes with Memory
Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in the square root of the block length. A complete characterization of the rate of polarization for models with memory has been missing. We consider polar codes for processes with memory that are characterized by an underlying ergodic finite ...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملPolarization Codes: Characterization of Exponent, Bounds, and Constructions
Polarization codes were recently introduced by Arıkan. They achieve the capacity of arbitrary symmetric binaryinput discrete memoryless channels (and even extensions thereof) under a low complexity successive decoding strategy. The original polar code construction is closely related to the recursive construction of Reed-Muller codes and is based on the 2× 2 matrix
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Foundations and Trends in Communications and Information Theory
دوره 8 شماره
صفحات -
تاریخ انتشار 2012